An order-based estimation of distribution algorithm for stochastic hybrid flow-shop scheduling problem

نویسندگان

  • Shengyao Wang
  • Ling Wang
  • Min Liu
  • Ye Xu
چکیده

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Taylor & Francis. The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

متن کامل

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

متن کامل

A Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

متن کامل

A novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study

Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...

متن کامل

A cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling

Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...

متن کامل

Electromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and ‎tardiness‎

‎In this paper, we study a flow shop batch processing machines scheduling problem. The fuzzy due dates are considered to make the problem more close to the reality. The objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. In order to tackle the given problem, we propose a hybrid electromagnetism-like (EM) algorithm, in which the EM is hybridized with a diversi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Computer Integrated Manufacturing

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2015